Continuous-time stochastic games with time-bounded reachability
نویسندگان
چکیده
منابع مشابه
Continuous-Time Stochastic Games with Time-Bounded Reachability
We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute εoptimal strategies in finite games and provide detailed complexity estimations. Moreover, we ...
متن کاملContinuous-time stochastic games
We study continuous-time stochastic games (with finitely many states and actions), with a focus on the existence of their equilibria that are insensitive to a small imprecision in the specification of players’ evaluations of streams of payoffs. We show that the stationary, namely, time-independent, discounting game has a stationary equilibrium, that the (not necessarily stationary) discounting ...
متن کاملTime-Bounded Reachability in Continuous-Time Markov Decision Processes
This paper solves the problem of computing the maximum and minimum probability to reach a set of goal states within a given time bound for locally uniform continuous-time Markov decision processes (CTMDPs). As this model allows for nondeterministic choices between exponentially delayed transitions, we define total time positional (TTP) schedulers which rely on the CTMDP’s current state and the ...
متن کاملExpected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to reach a target. These games are concurrent since at each step of the game both players choose a timed move (a time delay and action under their control), and the transition of the game is ...
متن کاملPolicy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent
Continuous-time Markov decision processes are an important class of models in a wide range of applications, ranging from cyberphysical systems to synthetic biology. A central problem is how to devise a policy to control the system in order to maximise the probability of satisfying a set of temporal logic specifications. Here we present a novel approach based on statistical model checking and an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2013
ISSN: 0890-5401
DOI: 10.1016/j.ic.2013.01.001